| 翻訳と辞書 |
| Optimal solutions for Rubik's Cube ： ウィキペディア英語版 |
Optimal solutions for Rubik's Cube
There are many algorithms to solve scrambled Rubik's Cubes. The maximum number of face turns needed to solve any instance of the Rubik's Cube is 20,〔(God's Number is 20 )〕 and the maximum number of quarter turns is 26. Described below in greater detail. These numbers are also the diameters of the corresponding Cayley graphs of the Rubik's Cube group. An algorithm that solves a cube in the minimum number of moves is known as God's algorithm.
There are two common ways to measure the length of a solution. The first is to count the number of quarter turns. The second is to count the number of face turns. A move like F2 (a half turn of the front face) would be counted as 2 moves in the quarter turn metric and as only 1 turn in the face metric.
== Move notation ==
To denote a sequence of moves on the 3×3×3 Rubik's Cube, this article uses "Singmaster notation", which was developed by David Singmaster.
The letters L,R,F,B,U,D indicate a quarter clockwise turn of the left, right, front, back, up and down face respectively. Half turns are indicated by appending a 2. A quarter counterclockwise turn is indicated by appending a prime symbol ( ′ ).
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Optimal solutions for Rubik's Cube」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|